To a matroid M with n edges, we associate the so-called facet ideal F(M)⊂k[x1,…,xn] , generated by monomials corresponding to bases of M. We show that when M is a graph, the Betti numbers related to an ℕ0-graded minimal free resolution of F(M) are determined by the Betti numbers related to the blocks of M. Similarly, we show that the higher weight hierarchy of M is determined by the weight hierarchies ...

We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues to relative generalized Hamming weights in the linear case.

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M. Our main result is that these polynomials are determined by Betti numbers associated with N0-graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M. Generalizing Greene’s the- orem from coding theory, we show that ...

We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are associated to linear codes, our definitions coincide with those for codes. Thus our Wei duality is a generalization of that for linear codes given by Schaathun. In ...

We study binary linear codes C obtained from the quadric Veronese embedding of P³ in P⁹ over F₂. We show how one can find the higher weight spectra of these codes. Our method will be a study of the Stanley-Reisner rings of a series of matroids associated to each code <i>C</i>.

We consider linear codes over a finite field Fq, for odd q, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a codeword is derived. Using this formula, we have computed the minimum distance for the codes corresponding to matrices upperbounded by any fixed, even rank. A conjecture is proposed for the cases where the upper bound is ...

We consider the notion of a (<i>q,m)</i>-polymatroid, due to Shiromoto, and the more general notion of (<i>q,m</i>)-demi-polymatroids, and show how generalized weights can be defined for them. Further, we establish a duality for these weights analogous to Wei duality for generalized Hamming weights of linear codes. The corresponding results of Ravagnani for Delsarte rank metric codes, and Martínez-Peñas ...

In this paper we study various aspects concerning almost affine codes, a class including, and strictly larger than, that of linear codes. We use the combinatorial tool demi-matroids to show how one can define relative length/dimension and dimension/length profiles of flags (chains) of almost affine codes. In addition we show two specific results. One such result is how one can express the relative ...

We present several fundamental duality theorems for matroids and more general combinatorial structures. As a special case, these results show that the maximal cardinalities of fixed-ranked sets of a matroid determine the corresponding maximal cardinalities of the dual matroid. Our main results are applied to perfect matroid designs, graphs, transversals, and linear codes over division rings, in each ...